A Theorist ’ s Toolkit ( CMU 18 - 859 T , Fall 2013 ) Lecture 24 : Hardness Assumptions
نویسنده
چکیده
This lecture is about hardness and computational problems that seem hard. Almost all of the theory of hardness is based on assumptions. We make assumptions about some problems, then we do reductions from one problem to another. Then, we want to make the minimal number of assumptions necessary to show computational hardness. In fact, all work on computational complexity and hardness is essentially in designing efficient algorithms.
منابع مشابه
A Theorist ’ s Toolkit ( CMU 18 - 859 T , Fall 2013 ) Lecture 03 : Chernoff / Tail Bounds
where Φ(t) is the probability that the Gaussian distribution is at most t and t ≥ 1. This tells us that the probability that we exceed the standard deviation decreases very rapidly. As an example, consider t = 10 √ lnn. Then we get Pr [ H ≥ n 2 + t √ n 2 ] ≤ e−50 lnn = 1 n50 . However, the error term of our above approximation is ±O( 1 √ n ), which is important in this example because the error...
متن کاملA Theorist ’ s Toolkit ( CMU 18 - 859 T , Fall 2013 ) Lecture 16 : Constraint Satisfaction Problems 10 / 30 / 2013
First let’s make sure this is actually a relaxation of our original problem. To see this, consider an optimal cut F ∗ : V → {1,−1}. Then, if we let ~ vi = (F (vi), 0, . . . , 0), all of the constraints are satisfied and the objective value remains the same. So, any solution to the original problem is also a solution to this vector program and therefore we have a relaxation. We will use SDPOpt t...
متن کاملA Theorist ’ s Toolkit ( CMU 18 - 859 T , Fall 2013 ) Lecture 14 : Linear Programming II
At a big conference in Wisconsin in 1948 with many famous economists and mathematicians, George Dantzig gave a talk related to linear programming. When the talk was over and it was time for questions, Harold Hotelling raised his hand in objection and said “But we all know the world is nonlinear,” and then he sat down. John von Neumann replied on Dantzig’s behalf “The speaker titled his talk ‘li...
متن کاملA Theorist ’ s Toolkit ( CMU 18 - 859 T , Fall 2013 ) Lecture 12 : Expanders
The third property is included because random graphs are likely to have the first two properties. We do not want a random graph; we want it to be deterministically and efficiently constructible. There are many definitions used for expanders. We will always talk about an undirected graph G = (V,E). Here, |V | = n, where we consider n → ∞, and the graph is d-regular (i.e., deg(u) = d for all u ∈ ...
متن کاملTheorist ’ s Toolkit , Fall 2016 Nov 3 Lecture 19 : Solving Linear Programs
In Leture 18, we have talked about Linear Programming (LP). LP refers to the following problem. We are given an input of the following m constraints (inequalities):
متن کامل